At‐Most‐Hexa Meshes
نویسندگان
چکیده
Volumetric polyhedral meshes are required in many applications, especially for solving partial differential equations on finite element simulations. Still, their construction bears several additional challenges compared to boundary-based representations. Tetrahedral and (pure) hex-meshes two popular formats scenarios like CAD offering opposite advantages disadvantages. Hex-meshes more intricate construct due the global structure of meshing, but feature much better regularity, alignment, expressive, offer same simulation accuracy with fewer elements. Hex-dominant meshes, where most not all cell elements have a hexahedral structure, constitute an attractive compromise, potentially unlocking benefits from both structures, generality makes employment downstream applications difficult. In this work, we introduce strict subset general hex-dominant which term ‘at-most-hexa meshes’, cells still hexahedral, no has than six boundary faces, face four sides. We exemplify ease at-most-hexa by proposing frugal straightforward method generate high-quality kind, starting directly hulls or point clouds, example, 3D scan. contrast existing methods ours does require intermediate parameterization other costly pre-computations can start surfaces samples. leverage Lloyd relaxation process exploit synergistic effects aligning orientation field modified Voronoi diagram using norm cubical cells. The extracted geometry incorporates regularity as well following sharp edges curved surfaces. specialized operations three-dimensional graph enforce consistency during relaxation. resulting algorithm allows efficient evaluation parallel algorithms GPU hardware completes even large reconstructions within minutes.
منابع مشابه
Active-meshes
This paper describes the implementation of an `active-mesh' that is to be automatically created and con®gured directly from a single frame of an image sequence. The aim of this approach is to use the derived mesh to perform visual tracking in unconstrained motion environments, allowing movement of the camera, the scene and even the inclusion of background-independent moving objects. The main pr...
متن کاملSize complexity of volume meshes vs. surface meshes
Typical volume meshes in three dimensions are designed to conform to an underlying two-dimensional surface mesh, with volume mesh element size growing larger away from the surface. The surface mesh may be uniformly spaced or highly graded, and may have fine resolution due to extrinsic mesh size concerns. When we desire that such a volume mesh have good aspect ratio, we require that some space-f...
متن کاملOptimal Emulation of Meshes on Meshes of Trees
Many problems can be solved more eeciently on a mesh of trees network than on a mesh. Until now it has been an open problem whether the mesh of trees is always at least as fast as the mesh. In this paper, we present an emulation of N-node meshes on O(N)-node meshes of trees with constant slowdown, even though any embedding of a mesh into a mesh of trees requires dilation (log N). This demonstra...
متن کاملAutomatic Conversion of Triangular Meshes into Quadrilateral Meshes with Directionality
This paper presents a triangular-to-quadrilateral mesh conversion method that can control the directionality of the output quadrilateral mesh according to a user-specified vector field. Given a triangular mesh and a vector field, the method first scores all possible quadrilaterals that can be formed by pairs of adjacent triangles, according to their shape and directionality. It then converts th...
متن کاملOn optimal polynomial meshes
Let P d n be the the space of real algebraic polynomials of d variables and degree at most n, K ⊂ R a compact set, ||p||K := supx∈K |p(x)| the usual supremum norm on K, card(Y ) the cardinality of a finite set Y . A family of sets Y = {Yn ⊂ K, n ∈ N} is called an admissible mesh in K if there exists a constant c1 > 0 depending only on K such that ||p||K ≤ c1||p||Yn , p ∈ P d n , n ∈ N, where th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2021
ISSN: ['1467-8659', '0167-7055']
DOI: https://doi.org/10.1111/cgf.14393